The Metric Structure of Codes for the Binary Symmetric Channel

نویسندگان

  • JERZY NEYMAN
  • A. J. THOMASIAN
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver

Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages

Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...

متن کامل

Almost Sure Convergence of Relative Frequency of Occurrence of Burst Errors on Channels with Memory∗

Motivated by intention to evaluate asymptotically multiple-burst-error-correcting codes on channels with memory, we will derive the following fact. Let {Zi} be a hidden Markov process, i.e., a functional of a Markov chain with a finite state space, and Wb(Z1Z2 . . . Zn) denote the number of burst errors that appear in Z1Z2 . . . Zn, where the number of burst errors is counted using Gabidulin’s ...

متن کامل

On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels

Most of the basic concepts of algebraic coding theory are derived for the memoryless binary symmetric channel. These concepts do not necessarily hold for time-varying channels or for channels with memory. However, errors in real-life channels seem to occur in bursts rather than independently, suggesting that these channels exhibit some statistical dependence or memory. Nonetheless, the same alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005